Controlled Markov chains with safety upper bound

نویسندگان

  • Ari Arapostathis
  • Ratnesh Kumar
  • Sekhar Tangirala
چکیده

In this paper we introduce and study the notion of safety control of stochastic discrete event systems (DESs), modeled as controlled Markov chains. For non-stochastic DESs, modeled by state machines or automata, safety is specified as a set of forbidden states, or equivalently by a binary valued vector that imposes an upper bound on the set of states permitted to be visited. We generalize this notion of safety to the setting of stochastic DESs by specifying it as an unit-interval valued vector that imposes an upper bound on the state probability distribution vector. Under the assumption of complete state observation, we identify (i) the set of all state feedback controllers that satisfy the safety requirement for any given safe initial state probability distribution, and (ii) the set of all safe initial state probability distributions for a given state feedback controller.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Rate of Rényi Entropy for Irreducible Markov Chains

In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.

متن کامل

On Controlled Markov Chains with Optimality Requirement and Safety Constraint

We study the control of completely observed Markov chains subject to generalized safety bounds and optimality requirement. Originally, the safety bounds were specified as unit-interval valued vector pairs (lower and upper bounds for each component of the state probability distribution). In this paper, we generalize the constraint to be any linear convex set for the distribution to stay in, and ...

متن کامل

A new machine replacement policy based on number of defective items and Markov chains

  A novel optimal single machine replacement policy using a single as well as a two-stage decision making process is proposed based on the quality of items produced. In a stage of this policy, if the number of defective items in a sample of produced items is more than an upper threshold, the machine is replaced. However, the machine is not replaced if the number of defective items is less than ...

متن کامل

Mirror Descent Algorithm for Homogeneous Finite Controlled Markov Chains with Unknown Mean Losses ?

We consider the adaptive stochastic problem for a system described by a controlled Markov chain (CMC) with a finite number of states. The novelty of the approach consists in adaptation technique for optimization of the system with unknown distribution of the cost function. This approach is applicable to the Internet congestion control with active users, motivating our study. In fact, we conside...

متن کامل

Mixing times of Lozenge Tiling and Card Shuffling Markov Chains

We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application is to a class of Markov chains introduced by Luby, Randall, and Sinclair to generate random tilings of regions by lozenges. For an l×l region we bound the mix...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Automat. Contr.

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2003